Solving the Graph Partitioning based on Cuckoo Optimization Algorithm (COA)

نویسندگان

  • Sina Zangbari Kouhi
  • Faranak Nejati
  • Jaber Karimpour
چکیده

In this paper a new efficient approach to solving the balanced connected partitioning is presented. The graph partitioning problem has been used in many areas of computer science like LSI design; electrical power networks (EPNs) and ect. The problem aims to obtaining sub graphs of a graph which include balance connected vertices. The proposed solution is based on Cuckoo Optimization Algorithm (COA) that is a novel evolutionary optimization algorithm. This method is inspired by the life structure of a bird family which is called cuckoo. To prove the performance of this approach two hardness instances are used. Keyword: Graph partitioning, COA, optimization algorithm, meta-hubristic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved COA with Chaotic Initialization and Intelligent Migration for Data Clustering

A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...

متن کامل

Sustainable Supplier Selection by a New Hybrid Support Vector-model based on the Cuckoo Optimization Algorithm

For assessing and selecting sustainable suppliers, this study considers a triple-bottom-line approach, including profit, people and planet, and regards business operations, environmental effects along with social responsibilities of the suppliers. Diverse metrics are acquainted with measure execution in these three issues. This study builds up a new hybrid intelligent model, namely COA-LS-SVM, ...

متن کامل

Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem

In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature, such as particle swarm optimization (PSO), firefly algorithm (FA) and cuckoo optimization algorithm (COA). Recently introduced COA, has proven its excellent capabilities, such as faster convergence and better global minimum achievement. In this paper a ne...

متن کامل

Energy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm

Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...

متن کامل

Applications of two new algorithms of cuckoo optimization (CO) and forest optimization (FO) for solving single row facility layout problem (SRFLP)

Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013